Curvature Variation as Measure of Shape Information

نویسندگان

  • Mongi A. Abidi
  • Michael J. Roberts
  • David L. Page
  • Andrei V. Gribok
  • Anne Mayhew
چکیده

In this thesis, we present the Curvature Variation Measure (CVM) as our informational approach to shape description. We base our algorithm on shape curvature, and extract shape information as the entropic measure of the curvature. We present definitions to estimate curvature for both discrete 2D curves and 3D surfaces and then formulate our theory of shape information from these definitions. With focus on reverse engineering and under vehicle inspection, we document our research efforts in constructing a scanning mechanism to model real world objects. We use a laser-based range sensor for the data collection and discuss view-fusion and integration to model real world objects as triangle meshes. With the triangle mesh as the digitized representation of the object, we segment the mesh into smooth surface patches based on the curvedness of the surface. We perform region-growing to obtain the patch adjacency and apply the definition of our CVM as a descriptor of surface complexity on each of these patches. We output the real world object as a graph network of patches with our CVM at the nodes describing the patch complexity. We demonstrate this algorithm with results on automotive components.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Surface Shape Description of 3D Data from Under Vehicle Inspection Robot

Our research efforts focus on the deployment of 3D sensing capabilities to a multi-modal under vehicle inspection robot. In this paper, we outline the various design challenges towards the automation of the 3D scene modeling task. We employ laser-based range imaging techniques to extract the geometry of a vehicle’s undercarriage and present our results after range integration. We perform shape ...

متن کامل

Shape analysis algorithm based on information theory

In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We base our algorithm on shape curvature, and thus we compute shape information as the entropy of curvature. We present definitions to estimate curvature for both discrete curves and surfaces and then formulate our theory...

متن کامل

Estimation of Source Location Using Curvature Analysis

A quadratic surface can be fitted to potential-field data within 3×3 windows, which allow us to calculate curvature attributes from its coefficients. Phillips (2007) derived an equation depending on the most negative curvature to obtain the depth and structural index of isolated sources from peak values of special functions. They divided the special functions into two categories: Model-specific...

متن کامل

Matching hierarchical structures for shape recognition

In this thesis we aim to develop a framework for clustering trees and representing and learning a generative model of graph structures from a set of training samples. The approach is applied to the problem of the recognition and classification of shape abstracted in terms of its morphological skeleton. We make five contributions. The first is an algorithm to approximate tree edit-distance using...

متن کامل

Geometric Curve Modeling with Sobolev Gradients

The Sobolev gradient method is a powerful tool for geometric modeling. We treat the problem of constructing fair curves by minimizing a fairness measure subject to geometric constraints. The measure might include curve length, curvature, torsion, and/or variation of curvature. The constraints may include specified values, tangent vectors, and/or curvature vectors. We may also require periodicit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004